Improving Brain Storm Optimization Algorithm via Simplex Search
نویسندگان
چکیده
Through modeling human’s brainstorming process, the brain storm optimization (BSO) algorithm has become a promising population based evolution algorithm. However, BSO is often good at global exploration but not good enough at local exploitation, just like most global optimization algorithms. In this paper, the Nelder-Mead’s Simplex (NMS) method is adopted in a simple version of BSO. Our goal is to combine BSO’s exploration ability and NMS’s exploitation ability together, and develop an enhanced BSO via a better balance between global exploration and local exploitation. Large number of experimental results are reported, and the proposed algorithm is shown to perform better than both BSO and NMS.
منابع مشابه
Augmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملFixture Design and Work Piece Deformation Optimization Using the Iterative Simplex Algorithm
Presents article is deal with optimization of the fixture for end milling process, the most important objective being the minimization of work piece deformation by changing the layout of fixture elements and the clamping forces. The main objective of this work has been the optimization of the fixtures Work piece deformation subjected to clamping forces for End milling operation. The present ana...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملWorst-case Analysis of Strategy Iteration and the Simplex Method
In this dissertation we study strategy iteration (also known as policy iteration) algorithms for solving Markov decision processes (MDPs) and twoplayer turn-based stochastic games (2TBSGs). MDPs provide a mathematical model for sequential decision making under uncertainty. They are widely used to model stochastic optimization problems in various areas ranging from operations research, machine l...
متن کاملMultiresponse surface optimization via Harmony search algorithm (Quality Engineering Conference Paper)
Response surface methodology is a common tool in optimizing processes. It mainly concerns situations when there is only one response of interest. However, many designed experiments often involve simultaneous optimization of several quality characteristics. This is called a Multiresponse Surface Optimization problem. A common approach in dealing with these problems is to apply desirability funct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.03166 شماره
صفحات -
تاریخ انتشار 2017